Random Regular Graph: Generation and Cover Time
نویسندگان
چکیده
A graph is r-regular if all its vertices have the same degree r. A random r-regular graph with n vertices is a graph sampled uniformly at random from the set of all r-regular graphs on n vertices. There are various sampling methods for this. In this report we survey one of them: The Configuration Model. We then survey the cover time of a random walk on such a graph, which roughly speaking, is the time taken (in expectation) by the walk to visit all the vertices. This cover time calculation, due to Colin Cooper and Alan Frieze, uses generating function technique and results from complex analysis, which we illustrate in this report.
منابع مشابه
Edge Cover Time for Regular Graphs
Consider the following stochastic process on a graph: initially all vertices are uncovered and at each step cover the two vertices of a random edge. What is the expected number of steps required to cover all vertices of the graph? In this note we show that the mean cover time for a regular graph of N vertices is asymptotically (N log N)/2. Moreover, we compute the exact mean cover time for some...
متن کاملCover Time On Regular Graph
Doyle & Snell (1984) [2] exposed many interesting connections between random walks and electrical network theory, by viewing an undirected graph as an electrical network in which each edge of the graph is replaced by an unit resistance. Their work and other follower’s work provide many useful tools from electrical network theory that can offer intuitive understanding of random walk behavior on ...
متن کاملThe cover time of regular random graphs
Let r ≥ 3 be integer, and let Gr denote the set of r-regular graphs with vertex set V = {1, 2, . . . , n}. Let G be chosen randomly from Gr. We prove that whp the cover time of a random walk on G is asymptotic to r−1 r−2 n log n.
متن کاملBounds On The Cover Time
Consider a particle that moves on a connected, undirected graph G with n vertices. At each step the particle goes from the current vertex to one of its neighbors, chosen uniformly at random. The cover time is the rst time when the particle has visited all the vertices in the graph starting from a given vertex. In this paper, we present upper and lower bounds that relate the expected cover time ...
متن کاملOn the Cover Time of Random Walks on Graphs
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound of O(n 2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of s log n) for the expected cover time...
متن کامل